Worst-case analysis of non-cooperative load balancing
نویسندگان
چکیده
منابع مشابه
Worst-case analysis of non-cooperative load balancing
We investigate the impact of heterogeneity in the amount of incoming traffic routed by dispatchers in a non-cooperative load balancing game. For a fixed amount of total incoming traffic, we give sufficient conditions on the cost function under which the worst-case social cost occurs when each dispatcher routes the same amount of traffic, that is, the game is symmetric. We then analyze the symme...
متن کاملPrice of anarchy in non-cooperative load balancing games
We investigate the price of anarchy of a load balancing game with K dispatchers. The service rates and holding costs are assumed to depend on the server, and the service discipline is assumed to be processor-sharing at each server. The performance criterion is taken to be the weighted mean number of jobs in the system, or equivalently, the weighted mean sojourn time in the system. Independently...
متن کاملWorst Case Analysis of Non-local Games
Non-local games are studied in quantum information because they provide a simple way for proving the difference between the classical world and the quantum world. A non-local game is a cooperative game played by 2 or more players against a referee. The players cannot communicate but may share common random bits or a common quantum state. A referee sends an input xi to the i th player who then r...
متن کاملCooperative Load Balancing for OFDMA Cellular Networks
Traffic shifting based load balancing (LB) schemes reduce the load of the hot-spot base station (BS), by shifting its traffic to its less-loaded neighbouring cells, called partners. Under the condition of multiple hot-spot BSs shifting traffic to one partner, this partner becomes a public partner. In conventional LB schemes, each hot-spot BS makes its traffic shifting decision independently. Th...
متن کاملCooperative load balancing in distributed systems
A serious difficulty in concurrent programming of a distributed system is how to deal with scheduling and load balancing of such a system which may consist of heterogeneous computers. In this paper, we formulate the static load-balancing problem in single class job distributed systems as a cooperative game among computers. The computers comprising the distributed system are modeled as M/M/1 que...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Operations Research
سال: 2014
ISSN: 0254-5330,1572-9338
DOI: 10.1007/s10479-014-1747-7